DNF sparsification and a faster deterministic counting algorithm
نویسندگان
چکیده
منابع مشابه
A Note on Deterministic Approximate Counting for k-DNF
We describe a deterministic algorithm that, for constant k, given a k-DNF or kCNF formula φ and a parameter ε, runs in time linear in the size of φ and polynomial in 1/ε and returns an estimate of the fraction of satisfying assignments for φ up to an additive error ε. For k-DNF, a multiplicative approximation is also achievable in time polynomial in 1/ε and linear in the size of φ. Previous alg...
متن کاملPARITY / ∈ AC from DNF Sparsification
We present a simple alternative proof of PARITY / ∈ AC using the DNF Sparsification Theorem of Gopalan, Meka and Reingold [1].
متن کاملGuided Search and a Faster Deterministic Algorithm for 3-SAT
Most deterministic algorithms for NP-hard problems are splitting algorithms: They split a problem instance into several smaller ones, which they solve recursively. Often, the algorithm has a choice between several splittings. For 3-SAT, we show that choosing wisely which splitting to apply, one can avoid encountering too many worst-case instances. This improves the currently best known determin...
متن کامل.1 Counting Dnf Satisfying Assignments
Suppose there is a bag containing red balls and blue balls. You would like to estimate the fraction of red balls in the bag. However, you are only allowed to sample randomly from the bag with replacement. The straightforward method is to make T random samples and use the fraction of red balls in the random samples as an estimate of the true fraction. The question is: how many samples are enough...
متن کاملDeterministic MST Sparsification in the Congested Clique
We give a simple deterministic constant-round algorithm in the congested clique model for reducing the number of edges in a graph to n1+ε while preserving the minimum spanning forest, where ε > 0 is any constant. This implies that in the congested clique model, it is sufficient to improve MST and other connectivity algorithms on graphs with slightly superlinear number of edges to obtain a gener...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: computational complexity
سال: 2013
ISSN: 1016-3328,1420-8954
DOI: 10.1007/s00037-013-0068-6